On pseudorandom number generators
نویسندگان
چکیده
منابع مشابه
Empirical Pseudorandom Number Generators
The most common pseudorandom number generator or PRNG, the linear congruential generator or LCG, belongs to a whole class of rational congruential generators. These generators work by multiplicative congruential method for integers, which implements a ”grow-and-cut procedure”. We extend this concept to real numbers and call this the real congruence, which produces another class of random number...
متن کاملCryptanalytic Attacks on Pseudorandom Number Generators
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, “random” nonces, and other values assumed to be random. We argue that PRNGs are their own unique type of cryptographic primitive, and should be analyzed as such. We propose a model for PRNGs, discuss possible attacks against this model, and demonstrate the app...
متن کاملSum-discrepancy test on pseudorandom number generators
We introduce a non-empirical test on pseudorandom number generators (prng), named sum-discrepancy test. We compute the distribution of the sum of consecutive m outputs of a prng to be tested, under the assumption that the initial state is uniformly randomly chosen. We measure its discrepancy from the ideal distribution, and then estimate the sample size which is necessary to reject the generato...
متن کاملEngineering Nonlinear Pseudorandom Number Generators
In the era of multi and many-core processors, computer simulations increasingly require parallel, small and fast pseudorandom number generation. Although linear generators lend themselves to a simpler evaluation that ensures favorable properties like guaranteed period, they may adversely affect the result of simulations or be quite large. Conversely, nonlinear generators may provide apparently ...
متن کاملEvolving Cryptographic Pseudorandom Number Generators
Random number generators (RNGs) play an important role in many real-world applications. Besides true hardware RNGs, one important class are deterministic random number generators. Such generators do not possess the unpredictability of true RNGs, but still have a widespread usage. For a deterministic RNG to be used in cryptography, it needs to fulfill a number of conditions related to the speed,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACTA IMEKO
سال: 2020
ISSN: 2221-870X
DOI: 10.21014/acta_imeko.v9i4.730